COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.device xgp
C00005 ENDMK
C⊗;
.device xgp
.page frame 90 wide 53 high;
.area text lines 5 to 46;
.title area heading lines 1 to 4;
.title area footing lines 47 to 53;
.turn on "%"
.font 1 "metli";
.font 2 "buck75";
.font 3 "sgn114";
.font 4 "corner";
.every heading(,%4CDCDCDCDCD%1,);
.every footing(,%4cdcdcdcdcd%1,);
.begin single space;
.begin center


%3ANNOUNCING%2
.group skip 2
%2COMPUTATIONAL LOGIC%1
.end
.narrow 8,16;
.group skip 2
A new class is being offered for the first time Winter Quarter 1980. This is
the first in a series of courses to be introduced in the area of the
Mathematical Theory of Computation. The concepts of Truth, Deduction, and
Computation, as they apply to Propositional and Predicate Logic will be
investigated. The course will begin with a brief review of Propositional
Logic, pointing out the distinctions among truth, provability, and 
computability, and introducing the meta-theoretic notions of consistency,
soundness, completeness, and decidability.  We will then study the Predicate
Calculus along the same lines. We will take an informal look at primitive
recursive functions and proof by induction, leading into the use of Logic
as a programming language.  PREREQUISITE: some previous exposure to Propositional
Logic (truth tables and the logical connectives).
.end